K-NN query algorithm based on PB-tree with the parallel lines division
نویسندگان
چکیده
منابع مشابه
K-NN algorithm in Parallel VLSI Simulation Scheduling
Parallel discrete event simulation has been established as a technique which has great potential to speed up the execution of gate level circuit simulation. A fundamental problem posed by a parallel environment is the decision of whether it is best to simulate a particular circuit sequentially or on a parallel platform.Furthermore, in the event that a circuit should be simulated on a parallel p...
متن کاملAn Approach to Indexing and Retrieval of Spatial Data with Reduced R+ Tree and K-NN Query Algorithm
Recently, “spatial data bases have been extensively adopted in the recent decade and various methods have been presented to store, browse, search and retrieve spatial objects”. In this study, a method is plotted for retrieving nearest neighbors from spatial data indexed by R+ tree. The approach uses a reduced R+ tree for the purpose of representing the spatial data. Initially the spatial data i...
متن کاملDetermining Learner Pronunciation Models with the K-nn Algorithm
Most phonetic learner corpora are dictionary-based and transcribe a target / pronunciation model for learners [1], which is usually an American pronunciation model, because the electronic resources for British English are scarce. This paper proposes to investigate which reference pronunciation model learners aim to emulate, by comparing their realisations with two reference formant datasets, wh...
متن کاملA Gradient-Based Metric Learning Algorithm for k-NN Classifiers
The Nearest Neighbor (NN) classification/regression techniques, besides their simplicity, are amongst the most widely applied and well studied techniques for pattern recognition in machine learning. A drawback, however, is the assumption of the availability of a suitable metric to measure distances to the k nearest neighbors. It has been shown that k-NN classifiers with a suitable distance metr...
متن کاملConfidential and Efficient Query Services in the Cloud Using K-NN with R-Tree and Rasp Data Perturbation
With the development of services computing and cloud computing, it has become possible to outsource large databases to database service providers and let the providers maintain the rangequery service. However, some data might be sensitive that the data owner does not want to move to the cloud unless the data confidentiality and query privacy are guaranteed. We propose the Random Space Encryptio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mobile Computing
سال: 2012
ISSN: 2192-1121
DOI: 10.1186/2192-1121-1-10